i-node table

   In Unix, a list of all the i-nodes in a filesystem. Within the i-node table, each i-node is known by a number— the i-number, or index number. If a file is defined by i-node \#300, it is said to have an i-number of 300.
   See also information node.

Dictionary of networking . 2014.

Look at other dictionaries:

  • Table of political parties in Europe by pancontinental organisation — The majority of major political parties in Europe have aligned themselves into one of the pan European political organisations listed below. Nine of these organisations have been legally recognized by the European Union as political parties at… …   Wikipedia

  • information node —    Abbreviated i node, sometimes written inode, pronounced [eye node]. In Unix, a data structure on disk that describes a file.    Each directory entry associates a filename with an i node; although a single file may have several filenames, one… …   Dictionary of networking

  • Distributed hash table — A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value… …   Wikipedia

  • Routing table — In computer networking a routing table, or Routing Information Base (RIB), is a data table stored in a router or a networked computer that lists the routes to particular network destinations, and in some cases, metrics (distances) associated with …   Wikipedia

  • Chord (distributed hash table) — Chord is one of the original distributed hash table protocols. Chord is being developed at MIT and the current Chord source code can be downloaded and used under the MIT License.Overview Using the Chord lookup protocol, node keys are arranged in… …   Wikipedia

  • Transposition table — In computer chess and other computer games, transposition tables are used to speed up the search of the game tree. Transposition tables are primarily useful in perfect information games, meaning the entire state of the game is known to all… …   Wikipedia

  • Lymph node biopsy — is a test in which a lymph node or a piece of a lymph node is removed for examination under a microscope (see: biopsy).The lymphatic system is made up of lymph nodes connected by lymph vessels. The nodes produce white blood cells (lymphocytes)… …   Wikipedia

  • Chain hash table — This is a hash table implementation. Here collisions are handled by Chaining.The divisor used is 13. A double Array is used for implementation ie Array of pointers. 1 // Authors: Prerit Goel and Anant Sinha 2 #include 3 struct node 4 { 5 int… …   Wikipedia

  • Branch table — In computer programming, a branch table (sometimes known as a jump table) is a term used to describe an efficient method of transferring program control (branching) to another part of a program (or a different program that may have been… …   Wikipedia

  • 84882 Table Mountain — Infobox Planet minorplanet = yes width = 25em bgcolour = #FFFFC0 apsis = name = Table Mountain symbol = caption = discovery = yes discovery ref = discoverer = James Whitney Young discovery site = Table Mountain Observatory near Wrightwood,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.